Random number generator architecture and VLSI implementation

نویسندگان

  • Nicolas Sklavos
  • Paris Kitsos
  • Kyriakos Papadomanolakis
  • Odysseas G. Koufopavlou
چکیده

Security protocols and encryption algorithms are basically based on random number generators. In this paper, a new random number generator architecture is introduced. The produced number word length is equal to 160 bits. The philosophy architecture relies on the usage of the SHA hash function. The offered security strength of this certain hash function ensures the unpredictability of the produced number. Additionally, an efficient VLSI implementation for FPGA device of the proposed system is described. The proposed architecture is a flexible solution in application cases where the original physical sources of random number generators, such as electrical noise, are not available or at least not convenient. This architecture can also be used in any cryptographic algorithm and encryption/decryption system with highspeed performance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Implementation of Generic Algorithm Using VHDL on FPGA

Architecture. The development of a flexible very-large-scale integration (VLSI) for GA has been proposed in this paper. For the hardware architecture, we has develop on a random number generator (RNG), crossover, and mutation based on flexibility structure. This structure can dynamically perform to the 3 types chromosome encoding: binary encoding, real-value encoding, and integer encoding. The ...

متن کامل

High Quality Uniform Random Number Generation Using LUT Optimised State-transition Matrices

This paper presents a family of uniform random number generators designed for efficient implementation in Lookup table (LUT) based FPGA architectures. A generator with a period of 2j1 can be implemented using k flip-flops and k LUTs, and provides k random output bits each cycle. Each generator is based on a binary linear recurrence, with a state-transition matrix designed to make best use of al...

متن کامل

Pulse Modulation VLSI Implementation of Clustering Algorithm Based on Stochastic Association Model

The clustering algorithm employing “stochastic association”, which we have already proposed, offers a simple and efficient soft-max adaptation rule. The adaptation process is the same as the on-line K-means clustering method except for adding random fluctuation in the distortion error evaluation process. This paper describes VLSI implementation of this new clustering algorithm based on a pulse ...

متن کامل

An Algorithm for Fast Software Encryption

An algorithm for fast software encryption is proposed in this paper. It is based on the architecture of new pseudo random number generator (PRNG), named Self−Shrinking p–adic Generator (SSPG). In the paper first, the basic SSPG architecture and algorithm are recalled. Then, the software implementation in Visual C++ environment is presented. Finally, the results of some images and texts, encrypt...

متن کامل

Efficient VLSI implementation of soft-input soft-output fixed-complexity sphere decoder

Fixed-complexity sphere decoder (FSD) is one of the most promising techniques for the implementation of multiple-input multiple-output (MIMO) detection, with relevant advantages in terms of constant throughput and high flexibility of parallel architecture. The reported works on FSD are mainly based on software level simulations and a few details have been provided on hardware implementation. In...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002